The Word Problem of ACD-Ground Theories is Undecidable
نویسنده
چکیده
We prove that there exists an ACD-ground theory | an equational theory deened by a set of ground equations plus the associativity and commutativity of two binary symbols and +, and the distributivity of over + | for which the word problem is undecidable.
منابع مشابه
Hereditary Undecidability of Some Theories of Finite Structures
Using a result of Gurevich and Lewis on the word problem for finite semigroups, we give short proofs that the following theories are hereditarily undecidable: (1) finite graphs of vertex-degree at most 3; (2) finite nonvoid sets with two distinguished permutations; (3) finitedimensional vector spaces over a finite field with two distinguished endomorphisms.
متن کاملThe Word Matching Problem Is Undecidable In GeneralEven
We present a nite, special, and connuent string-rewriting system for which the word matching problem is undecidable. Since the word matching problem is the non-symmetric restriction of the word uniication problem, this presents a non-trivial improvement of the recent result that for this type of string-rewriting systems, the word uniication problem is undecidable (Otto 1995).
متن کاملApproach to Anemia in Hospitalized Patients with Infectious Diseases; Is it Appropriate?
Anemia of chronic diseases (ACD) is a common problem in patients with infectious diseases and can influence the quality of life and patients' survival. Despite the clinical importance of ACD, data are still lacking regarding this problem in the infectious diseases. This study aimed to evaluate the prevalence, related factors, outcome and approaches to anemia in the infectious diseases ward. Thi...
متن کاملApproach to Anemia in Hospitalized Patients with Infectious Diseases; Is it Appropriate?
Anemia of chronic diseases (ACD) is a common problem in patients with infectious diseases and can influence the quality of life and patients' survival. Despite the clinical importance of ACD, data are still lacking regarding this problem in the infectious diseases. This study aimed to evaluate the prevalence, related factors, outcome and approaches to anemia in the infectious diseases ward. Thi...
متن کاملOn the existence and decidability of unique decompositions of processes in the applied π-calculus
Unique decomposition has been a subject of interest in process algebra for a long time (for example in BPP [1] or CCS [2, 3]), as it provides a normal form and useful cancellation properties. We provide two parallel decomposition results for subsets of the applied π-calculus: we show that every closed normed (i.e. with a finite shortest complete trace) process P can be decomposed uniquely into ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Int. J. Found. Comput. Sci.
دوره 3 شماره
صفحات -
تاریخ انتشار 1992